Matchings, cutsets, and chain partitions in graded posets
نویسنده
چکیده
New properties that involve matchings, cutsets, or skipless chain partitions in graded posets are introduced and compared to familiar Sperner and chain partition properties. Related work is surveyed. We determine all possible combinations of these properties, with the exception of a long-standing open conjecture about L Y M posets, and provide a list of examples realizing these combinations.
منابع مشابه
Nested chain partitions of LYM posets
A long-standing conjecture states that all LYM posets possess nested chain partitions. We verify this conjecture for posets of rank 2. © 2004 Elsevier B.V. All rights reserved.
متن کاملApproximately Sampling Elements with Fixed Rank in Graded Posets
Graded posets frequently arise throughout combinatorics, where it is natural to try to count the number of elements of a fixed rank. These counting problems are often #Pcomplete, so we consider approximation algorithms for counting and uniform sampling. We show that for certain classes of posets, biased Markov chains that walk along edges of their Hasse diagrams allow us to approximately genera...
متن کاملAntichain Cutsets of Strongly Connected Posets
Rival and Zaguia showed that the antichain cutsets of a finite Boolean lattice are exactly the level sets. We show that a similar characterization of antichain cutsets holds for any strongly connected poset of locally finite height. As a corollary, we characterize the antichain cutsets in semimodular lattices, supersolvable lattices, Bruhat orders, locally shellable lattices, and many more. We ...
متن کاملn ! MATCHINGS , n ! POSETS
We show that there are n! matchings on 2n points without socalled left (neighbor) nestings. We also define a set of naturally labeled (2+2)free posets and show that there are n! such posets on n elements. Our work was inspired by Bousquet-Mélou, Claesson, Dukes and Kitaev [J. Combin. Theory Ser. A. 117 (2010) 884–909]. They gave bijections between four classes of combinatorial objects: matching...
متن کاملLinear Inequalities for Flags in Graded Posets
The closure of the convex cone generated by all flag f -vectors of graded posets is shown to be polyhedral. In particular, we give the facet inequalities to the polar cone of all nonnegative chain-enumeration functionals on this class of posets. These are in one-to-one correspondence with antichains of intervals on the set of ranks and thus are counted by Catalan numbers. Furthermore, we prove ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 144 شماره
صفحات -
تاریخ انتشار 1995